A Data Sorting and Searching Scheme Based on Distributed Asymmetric Searchable Encryption

Searchable encryption algorithm is a hot issue nowadays. It can sort the results of searching and return the optimal matching files. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user’s search pattern. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed Searchable asymmetric encryption, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security. Finally, experiments results show that our method has better retrieval efficiency.